From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path
نویسندگان
چکیده
منابع مشابه
From Directed Path to Linear Order - The Best Choice Problem for Powers of Directed Path
We examine the evolution of the best choice algorithm and the probability of its success from a directed path to the linear order of the same cardinality through kth powers of a directed path, 1 ≤ k < n. The vertices of a kth power of a directed path of a known length n are exposed one by one to a selector in some random order. At any time the selector can see the graph induced by the vertices ...
متن کاملFrom Path Graphs to Directed Path Graphs
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to find an odd sun when the method fails. This algorithm has several interesting consequences concerning the relationship between path graphs and directed path graphs. One is that for a directed path graph, path graph mode...
متن کاملMode Directed Path Finding
Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbing heuristics in learning first-order concepts, have been a dominating force in the area of multi-relational concept learning. However, hill-climbing heuristics are susceptible to local maxima and plateaus. In this paper, we sh...
متن کاملDirected Path Graphs
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph → Pk(D) of a digraph D is obtained by representing the directed paths on k vertices of D by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in D form a directed path on k + 1 vertices or form a directed cycle on k vertices in D. Several properties of → P3(...
متن کاملThe directed path partition conjecture
The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path with more than λ vertices then, for every pair (a, b) of positive integers with λ = a + b, there exists a vertex partition (A, B) of D such that no path in D〈A〉 has more than a vertices and no path in D〈B〉 has more than b vertices.We develop methods for finding the desired partitions for various cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2015
ISSN: 0895-4801,1095-7146
DOI: 10.1137/130950689